Automatic Making of Sokoban Problems
نویسندگان
چکیده
This paper describes our program that makes Sokoban problems automatically. Sokoban is one of one-person puzzles invented in Japan. The program consists of three stages: generation, checking and evaluation. First, candidates for problems are generated randomly by a prototype and three templates . Second, unsolvable candidates are removed by the Sokoban solver. Finally trivial or uninteresting candidates are removed by the evaluator. The problems that the program made are judged good by human experts. Creation of art by computer is an important target of Arti cial Intelligence. Our work can be characterized one of the attempts to create some arts by computers.
منابع مشابه
Domain-Independent Construction of Pattern Database Heuristics for Cost-Optimal Planning
Heuristic search is a leading approach to domain-independent planning. For cost-optimal planning, however, existing admissible heuristics are generally too weak to effectively guide the search. Pattern database heuristics (PDBs), which are based on abstractions of the search space, are currently one of the most promising approaches to developing better admissible heuristics. The informedness of...
متن کاملThe box mover problem
We show that the optimization problem is NP-hard for a wide class of motion planning puzzles, including classical SOKOBAN. We investigate a new problem, the Box Mover Problem (BMP), in which the agent is allowed to lift and carry boxes on a rectilinear grid in order to rearrange them. Some classical motion planning puzzles are special cases of BMP. We also identify a natural class of BMP instan...
متن کاملSokoban and Other Motion Planning Problems (extended Abstract)
We consider a natural family of motion planning problems with movable obstacles and obtain hardness results for them. Some members of the family are shown to be PSPACE-complete thus improving and extending (and also simplifying) a previous NP-hardness result of Wilfong. The family considered includes a motion planning problem which forms the basis of a popular computer game called SOKOBAN. The ...
متن کاملDifficulty Rating of Sokoban Puzzle
Sokoban puzzle is very challenging problem for both humans and computers. It also illustrates differences between human and artificial intelligence – different problems are difficult for humans and for computers. Whereas algorithmic techniques for Sokoban solving have been intensively studied by previous research, factors determining difficulty for humans have not been sufficiently explained so...
متن کاملSOKOBAN and other motion planning problems
We consider a natural family of motion planning problems with movable obstacles and obtain hardness results for them. Some members of the family are shown to be PSPACE-complete thus improving and extending (and also simplifying) a previous NP-hardness result of Wilfong. The family considered includes a motion planning problem which forms the basis of a popular computer game called SOKOBAN. The ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996